Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
521	Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2010-11-05 18:41:12 Complexity classes Community websites Mathematical optimization Conjectures P versus NP problem Structural complexity theory Stack Exchange Network NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
522	Pricing Network Edges to Cross a River Alexander Grigoriev1 , Stan van Hoesel1 , Anton F. van der Kraaij1 , Marc Uetz1 , and Mustapha Bouhtou2 1 Maastricht University, Quantitative Economics, P.O.Box 616, Add to Reading List Source URL: wwwhome.math.utwente.nl Language: English - Date: 2005-01-11 07:55:58 Complexity classes Operations research Network theory NP Shortest path problem Optimization problem Approximation algorithm Strongly NP-complete Flow network Theoretical computer science Computational complexity theory Applied mathematics
523	P, N P and Mathematics – a computational complexity perspective Avi Wigderson “P versus N P – a gift to mathematics from Computer Science” Steve Smale. Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2006-03-15 13:50:29 Complexity classes Mathematical optimization Structural complexity theory Mathematical logic P NP-complete Decision problem Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
524	Exact Algorithms and Fixed-Parameter Tractability Summary of Dagstuhl Seminar[removed]July–29. July 2005 Rod Downey 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-19 05:18:59 NP-complete problems Analysis of algorithms Matroid theory Parameterized complexity Complexity classes Clique problem Vertex cover Time complexity Matroid Theoretical computer science Computational complexity theory Mathematics
525	BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 42, Number 1, Pages 3–38 S[removed][removed]Article electronically published on September 30, 2004 Add to Reading List Source URL: www.ams.org Language: English - Date: 2010-01-14 12:40:23 Cryptography Integer sequences Finite fields Modular arithmetic Complexity classes AKS primality test Prime number Integer factorization NP Mathematics Primality tests Number theory
526	Witness Indistinguishable and Witness Hiding Protocols Uriel Feige, Adi Shamir Department of Applied Mathematics The Weizmann Institute of Science Rehovot 76100, Israel Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2004-04-12 23:16:13 Cryptographic protocols Probabilistic complexity theory Complexity classes Zero-knowledge proof Structural complexity theory Proof of knowledge Interactive proof system Non-interactive zero-knowledge proof IP Theoretical computer science Computational complexity theory Cryptography
527	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: stuff.mit.edu Language: English - Date: 2009-05-25 23:54:59 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
528	covering-revision-without-comments.dvi Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2013-01-24 06:29:17 Complexity classes NP-hard NP-complete P versus NP problem NP Polynomial hierarchy Polynomial P Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
529	Symposium on Theoretical Aspects of Computer Science[removed]Nancy, France), pp[removed]www.stacs-conf.org COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES XIAOYANG GU 1 AND JOHN Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-04 08:18:12 Complexity classes NP-complete NP Reduction P/poly Advice Many-one reduction Turing reduction Polynomial-time reduction Theoretical computer science Computational complexity theory Applied mathematics
530	On Applications of the Equilibrium Value Method Serena Booth December 12th, 2014 Abstract In 2010, Jain et al. [JJUW10] provided the first proof that QIP = PSPACE. Jain et al. used a Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:00 Computational complexity theory Quantum complexity theory QIP IP Interactive proof system QMA PSPACE BQP Soundness Theoretical computer science Applied mathematics Complexity classes

UPDATE